Faster Parameterized Algorithms for Minimum Fill-in
نویسندگان
چکیده
منابع مشابه
Subexponential parameterized algorithm for minimum fill-in
The Minimum Fill-in problem is to decide if a graph can be triangulated by adding at most k edges. Kaplan, Shamir, and Tarjan [FOCS 1994] have shown that the problem is solvable in time O(2O(k) + knm) on graphs with n vertices and m edges and thus is fixed parameter tractable. Here, we give the first subexponential parameterized algorithm solving Minimum Fillin in time O(2O( √ k log k) + knm). ...
متن کاملFaster Parameterized Algorithms for Minor Containment
The theory of Graph Minors by Robertson and Seymour is one of the deepest and significant theories in modern Combinatorics. This theory has also a strong impact on the recent development of Algorithms, and several areas, like Parameterized Complexity, have roots in Graph Minors. Until very recently it was a common belief that Graph Minors Theory is mainly of theoretical importance. However, it ...
متن کاملAsymptotically Faster Algorithms for Parameterized FACE COVER
The parameterized complexity of the face cover problem is considered. The input to this problem is a plane graph, G, of order n. The question asked is whether, for any fixed k, there exists a set of k or fewer vertices whose boundaries collectively cover (contain) every vertex in G. The fastest previously-published face cover algorithm is achieved with the bounded search tree technique, in whic...
متن کاملFaster Algorithms Parameterized by Clique-width
Many NP-hard problems, such as Dominating Set, are FPT parameterized by clique-width. For graphs of clique-width k given with a kexpression, Dominating Set can be solved in 4knO(1) time. However, no FPT algorithm is known for computing an optimal k-expression. For a graph of clique-width k, if we rely on known algorithms to compute a (23k − 1)expression via rank-width and then solving Dominatin...
متن کاملImproved Exponential-Time Algorithms for Treewidth and Minimum Fill-In
Exact exponential-time algorithms for NP-hard problems is an emerging field, and an increasing number of new results are being added continuously. Two important NP-hard problems that have been studied for decades are the treewidth and the minimum fill problems. Recently, an exact algorithm was presented by Fomin, Kratsch, and Todinca to solve both of these problems in time O∗(1.9601n). Their al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2010
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-010-9421-1